Controlled Content Crossover: A New Crossover Scheme and Its Application to Optical Network Component Allocation Problem
نویسندگان
چکیده
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to solve the constrained optimization problem, CCC finds the selected set of the components with the minimum cost while it keeps the total dispersion value of the answer within a double-sided limit. The simulation results show that CCC finds the optimum answer matching closely with CPLEX solution.
منابع مشابه
A modified NSGA-II solution for a new multi-objective hub maximal covering problem under uncertain shipments
Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and v...
متن کاملSelf-Crossover and Its Application to the Travelling Salesman Problem
Crossover is an important genetic operation that helps in random recombination of structured information to locate new points in the search space, in order to achieve a good solution to an optimization problem. The conventional crossover operation when applied on a pair of binary strings will usually not retain the total number of 1’s in the offsprings to be the same as that of their parents. B...
متن کاملAN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM
Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملOperator-probability Adaptation in a Genetic-algorithm/Heuristic Hybrid for Optical Network Wavelength Allocation
Operator-probability adaptation in a genetic-algorithm/ heuristic hybrid for minimum cost routing and wavelength allocation of multi-wavelength all-optical transport networks is described. The hybrid algorithm uses an object-oriented representation of networks, and incorporates four operators: path mutation, single-point crossover, reroute and shift-out. The adaptation algorithm is based on tha...
متن کامل